Structural analysis of handwritten mathematical expressions through fuzzy parsing
نویسندگان
چکیده
Including mathematical expressions in documents can be a tiresome and difficult process. A recognition system for handwritten mathematical expressions would greatly simplify the task, enabling users to enter expressions in an intuitive manner. In this paper a powerful yet efficient approach to handwritten mathematical expression recognition is presented. Our approach is built upon traditional shiftreduce parsing methods which have linear complexity, thus providing the necessary syntax checking and also the basis for an efficient system. Fuzzy logic is introduced to the basic parsing framework, which is appropriate given the ambiguous nature of symbol identities and spatial relationships in handwritten expressions. Multiple parses are explored whenever strong ambiguities arise, and the most likely expression tree is selected as the result.
منابع مشابه
An Eecient Syntactic Approach to Structural Analysis of On-line Handwritten Mathematical Expressions
Structural Analysis of On-line Handwritten Mathematical Expressions Kam-Fai Chan and Dit-Yan Yeung Technical Report HKUST-CS98-10 August 1998 Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong fkchan,[email protected] Abstract Machine recognition of mathematical expressions is not trivial even when all the individual characters a...
متن کاملA Structural Analysis Approach for Online Handwritten Mathematical Expressions
This paper proposes a structural analysis approach for mathematical expressions based on the Attribute String Grammar and the Baseline Tree Transformation approaches. The approach consists of geometrical feature extraction, parsing structure and expression analysis steps. The algorithm for structure parsing uses baselines, which are represented by geometrical features to recursively decompose t...
متن کاملAn e$cient syntactic approach to structural analysis of on-line handwritten mathematical expressions
Machine recognition of mathematical expressions is not trivial even when all the individual characters and symbols in an expression can be recognized correctly. In this paper, we propose to use de"nite clause grammar (DCG) as a formalism to de"ne a set of replacement rules for parsing mathematical expressions. With DCG, we are not only able to de"ne the replacement rules concisely, but their de...
متن کاملAn efficient syntactic approach to structural analysis of on-line handwritten mathematical expressions
Machine recognition of mathematical expressions is not trivial even when all the individual characters and symbols in an expression can be recognized correctly. In this paper, we propose to use Deenite Clause Grammar (DCG) as a formalism to deene a set of replacement rules for parsing mathematical expressions. With DCG, we are not only able to deene the replacement rules concisely, but their de...
متن کاملOn-Line Recognition of Handwritten Mathematical Expressions Based on Stroke-Based Stochastic Context-Free Grammar
In this paper, we propose a new framework for online handwritten mathematical expression recognition. In this approach, we consider handwritten mathematical expressions as the output of stroke generation processes based on a stochastic context-free grammar which generates handwritten expressions stochastically. We estimate the most likely expression candidate derived from the grammar, rather th...
متن کامل